#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
    string s;
    cin >> s;
    ll sum = 0;
    for (int i = 0; i < s.size(); i++) {
        sum += (s[i] - '0');
    }
    if (sum % 2 != 0) {
        cout << "No" << endl;
    } else {
        vector<int> dp(sum / 2 + 1, 0);
        for (int i = 0; i < s.size(); i++) {
            for (int j = sum / 2; j >= (s[i] - '0'); j--) {
                dp[j] = max(dp[j], dp[j - (s[i] - '0')] + (s[i] - '0'));
            }
        }
        if (dp[sum / 2] != sum / 2) {
            cout << "No" << endl;
        } else {
            cout << "Yes" << endl;
        }
    }
    return 0;
}